Connected graphs with prescribed median and periphery
نویسندگان
چکیده
منابع مشابه
Connected graphs with prescribed median and periphery
The eccentricity e(v) of a vertex v in a connected graph G is the distance between v and a vertex furthest from v in G. The center C(G) of G is the subgraph induced by those vertices of G having minimum eccentricity; the periphery P(G) is the subgraph induced by those vertices of G having maximum eccentricity. The distance d(v) of a vertex v in G is the sum of the distances from v to the vertic...
متن کاملTwo-connected graphs with prescribed three-connected components
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and whose black vertices are b...
متن کاملLocating Median Paths on Connected Outerplanar Graphs
During the last two decades, there has been a growing interest in locating extensive facilities, such as paths, on networks. In this paper we study the median path problem without restrictions on its length on the class of connected outerplanar graphs with equal weights assigned to the edges and nonnegative weights associated to the vertices. We provide a O(kn) time algorithm, where n is the nu...
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملFast generation of random connected graphs with prescribed degrees
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we prove optimality condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00080-g